Parallel recognition of series-parallel graphs
نویسندگان
چکیده
منابع مشابه
Parallel Recognition of Series-Parallel Graphs
Recently, He and Yesha gave an algorithm for recognizing directed series parallel graphs, in time O(log n) with linearly many EREW processors. We give a new algorithm for this problem, based on a structural characterization of series parallel graphs in terms of their ear decompositions. Our algorithm can recognize undirected as well as directed series parallel graphs. It can be implemented in t...
متن کاملAgeing Orders of Series-Parallel and Parallel-Series Systems with Independent Subsystems Consisting of Dependent Components
In this paper, we consider series-parallel and parallel-series systems with independent subsystems consisting of dependent homogeneous components whose joint lifetimes are modeled by an Archimedean copula. Then, by considering two such systems with different numbers of components within each subsystem, we establish hazard rate and reversed hazard rate orderings between the two system lifetimes,...
متن کاملParallel Decomposition of Generalized Series-Parallel Graphs
Received July 17, 1997; accepted May 1, 1998. Communicated by Wen-Lian Hsu. *A preliminary version of this paper appeared in the proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’97) Las Vegas, Nevada, pp. 890-896, 1997. Research supported in part by NSC under Grant 83-0408-E-008-004. JOURNAL OF INFORMATION SCIENCE AND ENGINEER...
متن کاملEquistable series-parallel graphs
A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We characterize those series-parallel graphs that are equistable, generalizing results of Mahadev, Peled and Sun about equistable outer-planar graphs.
متن کاملParallel Algorithms for Series Parallel Graphs
In this paper, a parallel algorithm is given that, given a graph G = (V;E), decides whether G is a series parallel graph, and if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log jEj log jEj) time and O(jEj) operations on an EREW PRAM, and O(log jEj) time and O(jEj) operations on a CRCW PRAM (note that ifG is a simple series parallel graph,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1992
ISSN: 0890-5401
DOI: 10.1016/0890-5401(92)90041-d